Least-squares spectral collocation for discontinuous and singular perturbation problems
نویسندگان
چکیده
منابع مشابه
Regularization of singular least squares problems
In this note we analyze the in uence of the regularization procedure applied to singular LS square problems It appears that due to nite numerical accuracy within the computer calculations the regularization parameter has to belong to a particular range of values in order to have the regularized solution close to that associated to the singular LS problem Surprisingly enough this range essential...
متن کاملA rational spectral collocation method for solving a class of parameterized singular perturbation problems
A new kind of numerical method based on rational spectral collocation with the sinh transformation is presented for solving parameterized singularly perturbed two-point boundary value problems with one boundary layer. By means of the sinh transformation, the original Chebyshev points are mapped onto the transformed ones clustered near the singular points of the problem. The results from asympto...
متن کاملBackward perturbation analysis for scaled total least-squares problems
The scaled total least-squares (STLS) method unifies the ordinary least-squares (OLS), the total leastsquares (TLS), and the data least-squares (DLS) methods. In this paper we perform a backward perturbation analysis of the STLS problem. This also unifies the backward perturbation analyses of the OLS, TLS and DLS problems. We derive an expression for an extended minimal backward error of the ST...
متن کاملTowards A Backward Perturbation Analysis For Data Least Squares Problems
Given an approximate solution to a data least squares (DLS) problem, we would like to know its minimal backward error. Here we derive formulas for what we call an “extended” minimal backward error, which is at worst a lower bound on the minimal backward error. When the given approximate solution is a good enough approximation to the exact solution of the DLS problem (which is the aim in practic...
متن کاملBackward Perturbation Bounds for Linear Least Squares Problems
Recently, Higham and Wald en, Karlson, and Sun have provided formulas for computing the best backward perturbation bounds for the linear least squares problem. In this paper we provide several backward perturbation bounds that are easier to compute and optimal up to a factor less than 2. We also show that any least squares algorithm that is stable in the sense of Stewart is necessarily a backwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2003
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(03)00415-1